3 A Compilation - Chart

Recent work in categorial grammar has seen proposals for a wide range of systems , diiering in their`resource sensit-ivity' and hence, implicitly, their underlying notion ofìinguistic structure'. A common framework for parsing such systems is emerging, whereby some method of linear logic theorem proving is used in combination with a system of labelling that ensures that only deductions appropriate to the relevant categorial formalism are allowed. This paper presents a deduction method for implicational linear logic that brings with it the be-neet that chart parsing provides for CFG parsing, namely avoiding the need to recompute intermediate results when searching exhaustively for all possible analyses. The method involves compiling possibly higher-order linear formu-lae to indexed rst-order formulae, over which deduction is made using just a single inference rule.